A Efficient Mapping Algorithm With Novel Node-Ranking Approach for Embedding Virtual Networks
نویسندگان
چکیده
منابع مشابه
proposing a novel algorithm for fault-tolerant relay node placement in wireless sensor networks
wireless sensor networks are composed of hundreds or thousands of small nodes called sensor that work together and are associated with a specific task or tasks to do. each of these nodes includes sensor, processor, communication components, a small memory and a source of energy. it is expected that wireless sensor networks will be used widely in many applications in near future. scalability and...
متن کاملA Novel Virtual Network Mapping Algorithm for Cost Minimizing
Resources assigned to virtual network are not optimal resources, which are caused by some scarce resources. To solve this problem, this paper proposes a novel virtual network mapping algorithm that can realize mapping cost minimizing, called CMVNMA, based on two characteristics of network virtualization environment, that is virtual network has lifecycle and substrate network resources are incre...
متن کاملA Novel Energy Efficient Relay Node Placement Approach for Wsn
Partitioning in wireless sensor network is an important aspect of research in wireless networks. Clusters or partitions in the network can be formed on the basis of either geographical area of the nodes or on the basis of some performance parameters. Also the nodes which form the cluster are either homogenous or heterogeneous in nature. In the proposed approach an objective function is proposed...
متن کاملA Novel Hybrid Node Localization Algorithm for Wireless Sensor Networks
Node self-localization is one of the supporting technologies in Wireless Sensor Networks (WSNs). In this study, a distributed hybrid localization algorithm based on divide-and-conquer and refinement method is proposed. Firstly, the effect of ranging error in the Received Signal Strength (RSS) model on node localization is analyzed and the topology relations of anchors and unknown nodes are deri...
متن کاملNode-ranking schemes for the star networks
In this paper, three new node-ranking schemes for the star graph are presented and evaluated. These node-ranking schemes efficiently ‘‘embed’’ grids, pipelines, and reconfigurable multiple ring networks (cases of torus networks). These schemes improve similar known results on the star graph. They also allow efficient mapping of a wide class of algorithms into the star graph and hence facilitati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2761840